Sphere-bound-achieving coset codes and multilevel coset codes

A simple sphere bound gives the best possible tradeoff between the volume per point of an infinite array and its error probability on an additive white Gaussian noise (AWGN) channel. It is shown that the sphere bound can be approached by a large class of coset codes or multilevel coset codes with multistage decoding, including certain binary lattices. These codes have structure of the kind that has been found to be useful in practice. Capacity curves and design guidance for practical codes are given. Exponential error bounds for coset codes are developed, generalizing Poltyrev’s bounds for lattices. These results are based on the channel coding theorems of information theory, rather than the Minkowski—Hlawka theorem of lattice theory.